A fixed-point algorithm to estimate the Yule–Simon distribution parameter
نویسندگان
چکیده
منابع مشابه
A generalization of the fixed point estimate
In this paper, the problem of proportional covariance matrices estimation for random Gaussian complex vectors is investigated. The maximum likelihood estimates of the matrix and the scale factors are derived, and their statistical performances are studied, through bias, consistency and asymptotic distribution. It is also shown that the problem treated here generalizes the covariance estimation ...
متن کاملAn Algorithm to Estimate the Two-Way Fixed Effects Model
We present an algorithm to estimate the two-way fixed effect linear model. The algorithm relies on the Frisch-Waugh-Lovell theorem and applies to ordinary least squares (OLS), two-stage least squares (TSLS) and generalized method of moments (GMM) estimators. The coefficients of interest are computed using the residuals from the projection of all variables on the two sets of fixed effects. Our a...
متن کاملAn Algorithm to Estimate the Two-Way Fixed Effect Model
We present an algorithm to estimate the two-way fixed effect linear model. The algorithm relies on the Frisch-Waugh-Lovell Theorem and applies to ordinary least squares (OLS), two-stage least squares (TSLS) and generalized method of moments estimators (GMM). The coefficients of interest are computed using the residuals from the projection of all variables on the two sets of fixed-effects. Our a...
متن کاملA Fixed-Parameter Algorithm for String-to-String Correction
In the String-to-String Correction problem we are given two strings x and y and a positive integer k, and are asked whether it is possible to transform y into x with at most k single character deletions and adjacent character exchanges. We present a first simple fixed-parameter algorithm for Stringto-String Correction that runs in O∗(2k). Moreover, we present a search tree algorithm that exhibi...
متن کاملA Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the bipartite graph whose vertices are the variables and clauses of the given CNF formula; a variable and a clause are joined by an edge if and only if the variable occurs in the clause. Our algorithm runs in time O(4 k l N), where k denotes the incidence treewidth, l deno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2011
ISSN: 0096-3003
DOI: 10.1016/j.amc.2011.03.092